Fixed-Profile Load Scheduling for Large-Scale Irrigation Channels
نویسندگان
چکیده
منابع مشابه
Fixed-profile load scheduling for large-scale irrigation channels
The problem of fixed-profile load scheduling is considered for large-scale irrigation channels. Based on the analysis of the special structure of a channel under decentralised control, a predictive model is built on a pool-by-pool basis and a decomposition strategy of the scheduling problem is provided. The decomposition avoids excessive memory requirements in building the predictive model of t...
متن کاملLoad Scheduling with Profile Information
Within the past five years, many manufactures have added hardware performance counters to their microprocessors to generate profile data cheaply. We show how to use Compaq’s DCPI tool to determine load latencies which are at a fine, instruction granularity and use them as fodder for improving instruction scheduling. We validate our heuristic for using DCPI latency data to classify loads as hits...
متن کاملScheduling for Large-Scale Systems
In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task graph represents the application, nodes denote computational tasks, and edges model precedence constraints between tasks. For each task, an assignment (choose the processor that will execute the task) and a schedule (decide when to start the execution) are determined. Th...
متن کاملScheduling for Large - Scale On - Demand Data
| Recent advances in telecommunications have enabled the deployment of broadcast-based wide-area information services that provide on-demand data access to very large client populations. In order to eeectively utilize a broadcast medium for such a service, it is necessary to have eecient, on-line scheduling algorithms that can balance individual and overall performance, and can scale in terms o...
متن کاملDistributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this work, we present a distributed model for solving large-scale CSPs in which agents are committed to sets of con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2011
ISSN: 1474-6670
DOI: 10.3182/20110828-6-it-1002.01540